Phrase structures in FORTRAN

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Converting Dependency Structures to Phrase Structures

Treebanks are of two types according to their annotation schemata: phrase-structure Treebanks such as the English Penn Treebank [8] and dependency Treebanks such as the Czech dependency Treebank [6]. Long before Treebanks were developed and widely used for natural language processing, there had been much discussion of comparison between dependency grammars and context-free phrasestructure gramm...

متن کامل

Transforming Dependencies into Phrase Structures

PTB 23 Model F1 Sent./s. Charniak (2000) 89.5 Stanford PCFG (2003) 85.5 5.3 Petrov (2007) 90.1 8.6 Zhu (2013) 90.3 39.0 Carreras (008) 91.1 CJ Reranking (2005) 91.5 4.3 Stanford RNN (2013) 90.0 2.8 PAD 90.6 34.3 PAD (Pruned) 90.5 58.6 CTB 5 Model F1 Charniak (2000) 80.8 Bikel (2004) 80.6 Petrov (2007) 83.3 Zhu (2013) 83.2 PAD 82.4 Experiments Contributions • A phrase-structure parser (PAD) achi...

متن کامل

Converting Phrase Structures to Dependency Structures in Sanskrit

Two annotations schemes for presenting the parsed structures are prevalent viz. the constituency structure and the dependency structure. While the constituency trees mark the relations due to positions, the dependency relations mark the semantic dependencies. Free word order languages like Sanskrit pose more problems for constituency parses since the elements within a phrase are dislocated. In ...

متن کامل

Tracing the Cache Behaviour of Data Structures in Fortran Applications

In an application, data access can become a major performance bottleneck if the memory hierarchy of the underlying hardware architecture is not taken into account. The only way to gain deeper insight of an applications memory usage is to measure its data access behavior with hardware counters. From the programmer’s point of view such performance data (like cache misses or hits) have to be linke...

متن کامل

Tracing the Cache Behavior of Data Structures in Fortran Applications

c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1971

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/14.3.224